Tree Scheduling with Communication Delays
نویسنده
چکیده
This paper considers the problem of scheduling a tree-structured task system in a distributed environment with the goal of minimizing the makespan. Interprocessor communication delays are taken into account and task duplication is allowed. Furthermore, it is assumed that the number of processors is unlimited. It is shown that there is a polynomial-time algorithm for an outtree and that the intree case is NP-hard. In addition, a special case of intree is shown to be polynomially solvable.
منابع مشابه
Scheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملOptimal Task Scheduling of a Complete K-Ary Tree with Communication Delays
It is known that task scheduling problem of a complete kary intree with unit time tasks and general communication delays onto an unlimited number of processors is NP-complete. In this paper, we show that such a problem can be solved in linear time if we restrict communication delays within the range from (k− 1) to k unit times. We also show that naive scheduling is optimal if communication dela...
متن کاملNear-Optimal Task Scheduling of a Complete K-ary Tree with Communication Delays
It is known that task scheduling problem of an intree with unit time tasks and unit time communication delays onto a limited number of processors is NP-hard. In this paper, we show that such a problem is approximable within a factor of 3 if we assume a complete k-ary intree with at most (k − 1) constant communication delay. Also we prove that the problem is approximable within a factor of 2 if ...
متن کاملMinimizing the volume in scheduling an out-tree with communication delays and duplication
We consider in this paper a scheduling problem given by n tasks of same processing time d, an out-tree, communication delays all equal to c d and an integer t. The problem is to nd the minimum volume of a feasible schedule with makespan t. Studying the dominance properties of such schedules, we prove that this problem is polynomial using a dynamic programming algorithm.
متن کاملSensitivity analysis of tree scheduling on two machines with communication delays
This paper presents a sensitivity analysis for the problem of scheduling UET trees with communication delays on two identical processors, to minimize the makepan. Indeed, actual communication delays may not be precisely known before the execution. The paper compares the optimal makespans with and without communication delays. This is used to get sensitivity bounds for algorithms optimal in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 49 شماره
صفحات -
تاریخ انتشار 1994